Inference on Low-Rank Data Matrices with Applications to Microarray Data.

نویسندگان

  • Xingdong Feng
  • Xuming He
چکیده

Probe-level microarray data are usually stored in matrices, where the row and column correspond to array and probe, respectively. Scientists routinely summarize each array by a single index as the expression level of each probe-set (gene). We examine the adequacy of a uni-dimensional summary for characterizing the data matrix of each probe-set. To do so, we propose a low-rank matrix model for the probe-level intensities, and develop a useful framework for testing the adequacy of uni-dimensionality against targeted alternatives. This is an interesting statistical problem where inference has to be made based on one data matrix whose entries are not i.i.d. We analyze the asymptotic properties of the proposed test statistics, and use Monte Carlo simulations to assess their small sample performance. Applications of the proposed tests to GeneChip data show that evidence against a uni-dimensional model is often indicative of practically relevant features of a probe-set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Fixed Rank Approximation Algorithm for Missing Value Estimation for DNA Microarray Data

Gene expression data matriices often contain missing expression values. In this paper, we describe an improved fixed rank approximation algorithm (IFRAA) and compare it to the three recent methods for reconstructing missing entries for DNA microarray gene expression data: the Bayesian principal component analysis (BPCA), the fixed rank approximation algorithm (FRAA) and the local least squares ...

متن کامل

Application of Singular Value Decomposition to DNA Microarray

Sclove and Professor Jan Verschelde, for kindly agreeing to be on my committee despite their busy schedules. I would like to thank Kari Dueball and Darlette Willis for their assistance during my stay at UIC, the UIC mathematics department and the Institute of Mathematics and its Applications (IMA) for their generous support and fellowship, Ali Shaker and Marcus Bishop for kindly helping me with...

متن کامل

Deep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning

Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...

متن کامل

Order-Restricted Inference with Linear Rank Statistics in Microarray Data

The classification of subjects with unknown distribution in a small sample size often involves order-restricted constraints in multivariate parameter setups. Those problems make the optimality of a conventional likelihood ratio based statistical inferences not feasible. Fortunately, Roy (1953) introduced union-intersection principle(UIP) which provides an alternative avenue. Multivariate linear...

متن کامل

Face Recognition Based Rank Reduction SVD Approach

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • The annals of applied statistics

دوره 3 4  شماره 

صفحات  -

تاریخ انتشار 2009